A Generalized Max-Min Rate Allocation Policy and Its Distributed Implementation Using ABR Flow Control Mechanism

نویسندگان

  • Yiwei Thomas Hou
  • Henry H.-Y. Tzeng
  • Shivendra S. Panwar
چکیده

We generalize the classical max-min rate allocation policy with the support of the minimum rate requirement and peak rate constraint for each connection. Since a centralized algorithm for the generalized maxmin (GMM) rate allocation requires global information, which is di cult to maintain and manage in a large network, we develop a distributed protocol to achieve the GMM policy using the available bit rate (ABR) ow control mechanism. We give a proof that our distributed protocol converges to the GMM rate allocation through distributed and asynchronous iterations under any network con guration and any set of link distances.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generalized Max-Min Rate Allocation Policy and Its Distributed Implementation Using the ABR Flow Control Mechanism

We generalize the classical max-min rate allocation policy with the support of the minimum rate requirement and peak rate constraint for each connection. Since a centralized algorithm for the generalized maxmin (GMM) rate allocation requires global information, which is difficult to maintain and manage in a large network, we develop a distributed protocol to achieve the GMM policy using the ava...

متن کامل

Max-Min Fair Rate Control of ABR Connections with Nonzero MCRs

Traac sources that do not have intrinsic temporal characteristics are expected to be transported over ATM networks using the Available Bit Rate (ABR) service. These sources are amenable to reactive ow control and are expected to use bandwidth left over after servicing the guaranteed QoS services (CBR and VBR). Fair allocation of the available bandwidth to competing ABR connections is based on t...

متن کامل

A parametric Linear Programming Model Describing Bandwidth Sharing Policies for ABR Traffic

We consider the fair bandwidth allocation problem of ABR calls by a Connection Admission Controller (CAC) at call setup. Its general solution is given by applying the “max-min fairness allocation policy”. Extensions of this policy take into account the Minimum Cell Rate (MCR) and the Peak Cell Rate (PCR) traffic description parameters, which are essential for ABR. These extensions are distingui...

متن کامل

On Network Bandwidth Sharing Policies and Explicit Feedback Control Algorithms for Packet Networks

This paper presents an in-depth survey on network bandwidth allocation policies and discuss design methodologies of distributed rate calculation algorithms in packet-switched networks. In particular, we discuss two rate allocation policies: the generalized max-min (GMM) and the weight-proportional max-min (WPMM) policies, both of which generalize the classical max-min rate allocation policy. Fo...

متن کامل

A Simple ABR Switch Algorithm for the Weighted Max - Min Fairness Policy *

An important concept in the A B R service model is the minimum cell rate ( M C R ) guarantee as well as the peak cell rate (PCR) constraint for each A B R virtual connection. Due to the M C R and P C R requirements, the well-known max-min fairness policy is not suficient to determine the fair rate allocation in the ABR service model. W e present the weighted max-min ( W M M ) fairness policy, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998